ON INDUCTION VS-CONTINUITYKOZEN D.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 167-176; BIBL. 15 REF.Conference Paper

SEMANTICS OF PROBALISTICS PROGRAMSKOZEN D.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 3; PP. 328-350; BIBL. 30 REF.Article

COMPLEXITY OF BOOLEAN ALGEBRASKOZEN D.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 10; NO 3; PP. 221-247; BIBL. 20 REF.Article

INDEXINGS OF SUBRECURSIVE CLASSESKOZEN D.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 11; NO 3; PP. 277-301; BIBL. 20 REF.Article

A REPRESENTATION THEOREM FOR MODELS OF *-FREE PDLKOZEN D.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 351-362; BIBL. 27 REF.Conference Paper

SEMANTICS OF PROBABILISTIC PROGRAMSKOZEN D.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 101-114; BIBL. 34 REF.Conference Paper

A PROGRAMMING LANGUAGE FOR THE INDUCTIVE SETS, AND APPLICATIONSHAREL D; KOZEN D.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 313-329; BIBL. 2 P.Conference Paper

PROCESS LOGIC: EXPRESSIVENESS, DECIDABILITY, COMPLETENESSHAREL D; KOZEN D; PARIKH R et al.1982; JOURNAL OF COMPUTER AND SYSTEM SCIENCES; ISSN 0022-0000; USA; DA. 1982; VOL. 25; NO 2; PP. 144-170; BIBL. 34 REF.Article

Set constraints and logic ProgrammingKOZEN, D.Information and computation (Print). 1998, Vol 142, Num 1, pp 2-25, issn 0890-5401Conference Paper

Polynomial decomposition algorithmsKOZEN, D; LANDAU, S.Journal of symbolic computation. 1989, Vol 7, Num 5, pp 445-456, issn 0747-7171Article

Optimal bounds for the change-making problemKOZEN, D; ZAKS, S.Theoretical computer science. 1994, Vol 123, Num 2, pp 377-388, issn 0304-3975Article

Definability with bounded number of bound variablesIMMERMAN, N; KOZEN, D.Information and computation (Print). 1989, Vol 83, Num 2, pp 121-139, issn 0890-5401Article

Logics of programs, workshop, Pittsburgh PA, June 6-8, 1983CLARKE, E; KOZEN, D.Lecture notes in computer science. 1984, Vol 164, issn 0302-9743, VI-527 pConference Proceedings

A programming language for the inductive sets, and applicationsHAREL, D; KOZEN, D.Information and control. 1984, Vol 63, Num 1-2, pp 118-139, issn 0019-9958Article

Limits for automatic verification of finite-state concurrent systemsAPT, K. R; KOZEN, D. C.Information processing letters. 1986, Vol 22, Num 6, pp 307-309, issn 0020-0190Article

Decidability of systems of set constraints with negative constraintsAIKEN, A; KOZEN, D; WIMMERS, E et al.Information and computation (Print). 1995, Vol 122, Num 1, pp 30-44, issn 0890-5401Article

Efficient inference of partial typesKOZEN, D; PALSBERG, J; SCHWARTZBACH, M. I et al.Journal of computer and system sciences (Print). 1994, Vol 49, Num 2, pp 306-324, issn 0022-0000Article

A zero-one law for logic with a fixed-point operatorBLASS, A; GUREVICH, Y; KOZEN, D et al.Information and control. 1985, Vol 67, Num 1-3, pp 70-90, issn 0019-9958Article

A fast parallel algorithm for determining all roots of a polynomial with real rootsBEN-OR, M; FEIG, E; KOZEN, D et al.SIAM journal on computing (Print). 1988, Vol 17, Num 6, pp 1081-1092, issn 0097-5397Article